Online Dictionary Matching with Variable-Length Gaps
نویسندگان
چکیده
منابع مشابه
Mind the gap.
The Online Dictionary Matching with Gaps Problem (DMG), is the following. Preprocess a dictionary D of d gapped patterns P1, . . . , Pd such that given a query online text T presented one character at a time, each time a character arrives we must report the subset of patterns that have a match ending at this character. A gapped pattern Pi is of the form Pi,1{αi, βi}Pi,2, where Pi,1, Pi,2 ∈ Σ∗ a...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملDictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
In the string-matching problem one is interested in all occurrences of a short pattern string in a longer text string. Dictionary-matching is a generalization of this problem where one is looking simultaneously for all occurrences of several patterns in a single text. This paper presents an eecient on-line dictionary-matching algorithm for the case where the patterns have uniform length and the...
متن کاملA Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application
We propose a novel subsequence matching framework that allows for gaps in both the query and target sequences, variable matching tolerance levels efficiently tuned for each query and target sequence, and also constrains the maximum match length. Using this framework, a space and time efficient dynamic programming method is developed: given a short query sequence and a large database, our method...
متن کاملString Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in T that match P . This problem is a basic primitive in computational biology applications. Let m and n be the lengths of P and T , respective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011